The Bertini irreducibility theorem for higher codimensional slices

In [3], Poonen and Slavov recently developed a novel approach to Bertini irreducibility theorems over an arbitrary field, based on random hyperplane slicing. In this paper, we extend their work by proving an analogous bound for the dimension of the exceptional locus in the setting of linear subspaces of higher codimensions.     

微区X射线荧光成像技术在岩心分析中的应用

微区X射线荧光（Micro-XRF）分析技术是通过微小的X射线光束照射样品，对样品进行原位成分观测的无损分析手段之一，具有灵敏度高、速度快和准确性高的特点。采用微区X射线荧光光谱仪（M6 JETSTREAM）对安徽铜陵冬瓜山铜矿床四段岩心样品进行面扫描，分析不同矿层共17种元素区域分布特征、空间分布规律及组合关系等，结果表明：（1）Cu和Fe两种成矿元素高值空间分布区域基本不重叠，S与Fe分布范围高度重叠，关系密切，微量元素Ni，Bi，Pb，Zn，Si，Na与Cu密切相关，而Ti，Al，K与Fe具有弱相关性；（2）垂向上，Fe元素含量随深度增加逐步增大，而Cu元素含量呈降低趋势，其他元素也随深度呈下降趋势；（3）元素分布受石炭纪中期海底喷流沉积成矿作用和岩浆热液成矿作用叠加改造作用明显；（4）该钻孔矿石矿物以磁黄铁矿、黄铜矿和黄铁矿为主，垂向上组合规律明显，脉石矿物以石英、石榴子石和透辉石为主。该技术通过分析元素空间分布规律、相关性以及矿物组合和分配关系等可对元素富集和运移以及对矿床的成矿机制、成因模式等地质环境和地质过程提供新认识和新证据。结合矿床地球化学特征的分布模式，微量元素可作为寻找主矿种的指示元素，为深部找矿提供依据。此外，该技术能作为预分析技术快速筛选出感兴趣的信息和位置，为后期各种更高精度的微区分析提供不同尺度、不同层次的元素分布信息。     

A nonlinear model for marble sulphation including surface rugosity and mechanical damage

Here we propose and analyze a mathematical model that aims to describe the marble sulphation process occurring in a given material. The model accounts for rugosity as well as for damaging effects. This model is characterized by some technical difficulties that seem hard to overcome from a theoretical viewpoint. Therefore, we introduce some physically reasonable modifications in order to establish the existence of a suitable notion of solution on a given time interval. Numerical simulations are presented and discussed, also in view of further research.     

Subword complexity of the Fibonacci–Thue–Morse sequence: The proof of Dekking’s conjecture

Recently F. M. Dekking conjectured the form of the subword complexity function for the Fibonacci–Thue–Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.     

Words that almost commute

The Hamming distance $\mathrm{ham}(u,v)$ between two equal-length words u, v is the number of positions where u and v differ. The words u and v are said to be conjugates if there exist non-empty words $x,y$ such that $u=xy$ and $v=yx$. The smallest value $\mathrm{ham}(xy,yx)$ can take on is 0, when x and y commute. But, interestingly, the next smallest value $\mathrm{ham}(xy,yx)$ can take on is 2 and not 1. In this paper, we consider conjugates $u=xy$ and $v=yx$ where $\mathrm{ham}(xy,yx)=2$. More specifically, we provide an efficient formula to count the number $h(n)$ of length-n words $u=xy$ over a k-letter alphabet that have a conjugate $v=yx$ such that $\mathrm{ham}(xy,yx)=2$. We also provide efficient formulae for other quantities closely related to $h(n)$. Finally, we show that $h(n)$ grows erratically: cubically for n prime, but exponentially for n even.